Weak hypergraph regularity and applications to geometric Ramsey theory

نویسندگان

چکیده

Let ? = 1 × …<!-- … <mml:mi>d ?<!-- ? <mml:msup> mathvariant="double-struck">R n \Delta =\Delta _1\times \ldots \times \Delta _d\subseteq \mathbb {R}^n , where alttext="double-struck n midline-horizontal-ellipsis Super d"> ?<!-- ? encoding="application/x-tex">\mathbb {R}^n=\mathbb {R}^{n_1}\times \cdots {R}^{n_d} with each i i"> i _i\subseteq {R}^{n_i} a non-degenerate simplex of alttext="n encoding="application/x-tex">n_i points. We prove that any set alttext="upper S S encoding="application/x-tex">S\subseteq plus + encoding="application/x-tex">n=n_1+\cdots +n_d positive Banach density necessarily contains an isometric copy all sufficiently large dilates the configuration Delta"> encoding="application/x-tex">\Delta . In particular such 2 2 {R}^{2d} alttext="d"> encoding="application/x-tex">d -dimensional cube side length alttext="lamda"> ?<!-- ? encoding="application/x-tex">\lambda for alttext="lamda greater-than-or-equal-to lamda 0 left-parenthesis right-parenthesis"> ?<!-- ? <mml:mn>0 ( stretchy="false">) encoding="application/x-tex">\lambda \geq \lambda _0(S) also analogous results underlying space being integer lattice. The proof is based on weak hypergraph regularity lemma and associated counting developed in context Euclidean spaces

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Weak hypergraph regularity and linear hypergraphs

We consider conditions which allow the embedding of linear hypergraphs of fixed size. In particular, we prove that any k-uniform hypergraph H of positive uniform density contains all linear k-uniform hypergraphs of a given size. More precisely, we show that for all integers ` ≥ k ≥ 2 and every d > 0 there exists % > 0 for which the following holds: if H is a sufficiently large kuniform hypergra...

متن کامل

Model Theory and Hypergraph Regularity

1. Ultrafilters, ultraproducts and ultralimits 1 1.1. Filters and ultrafilters 1 1.2. Ultralimits 2 1.3. Some model-theoretic notation 3 1.4. Ultraproducts of first-order structures 3 1.5. References 6 2. Graph regularity and measures on ultraproducts 6 2.1. Szemerédi’s regularity lemma 6 2.2. Finitely additive measures 7 2.3. Obtaining countable additivity 9 2.4. Integration for charges (signe...

متن کامل

Hypergraph list coloring and Euclidean Ramsey theory

Abstract: It is well known that one can color the plane by 7 colors with no monochromatic configuration consisting of the two endpoints of a unit segment. In sharp contrast we show that for any finite set of points K in the plane, and for any finite integer s, one can assign a list of s distinct colors to each point of the plane, so that any coloring of the plane that colors each point by a col...

متن کامل

The Lifting of Graphs to 3-uniform Hypergraphs and Some Applications to Hypergraph Ramsey Theory

Given a simple graph Γ, we describe a “lifting” to a 3-uniform hypergraph φ(Γ) that sends the complement of Γ to the complement of φ(Γ). We consider the effects of this lifting on cycles, complete subhypergraphs, and complete subhypergraphs missing a single hyperedge. Our results lead to natural lower bounds for some hypergraph Ramsey numbers.

متن کامل

The hypergraph regularity method and its applications.

Szemeredi's regularity lemma asserts that every graph can be decomposed into relatively few random-like subgraphs. This random-like behavior enables one to find and enumerate subgraphs of a given isomorphism type, yielding the so-called counting lemma for graphs. The combined application of these two lemmas is known as the regularity method for graphs and has proved useful in graph theory, comb...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Transactions of the American Mathematical Society

سال: 2022

ISSN: ['2330-0000']

DOI: https://doi.org/10.1090/btran/61